Combining Hook Length Formulas and Bg-ranks for Partitions via the Littlewood Decomposition
نویسندگان
چکیده
Recently, the first author has studied hook length formulas for partitions in a systematic manner. In the present paper we show that most of those hook length formulas can be generalized and include more variables via the Littlewood decomposition, which maps each partition to its t-core and t-quotient. In the case t = 2 we obtain new formulas by combining the hook lengths and BG-ranks introduced by Berkovich and Garvan. As applications, we list several multivariable generalizations of classical and new hook length formulas, including the Nekrasov-Okounkov, the Han-Carde-LoubertPotechin-Sanborn, the Bessenrodt-Bacher-Manivel, the Okada-Panova and the Stanley-Panova formulas. Summary §
منابع مشابه
Discovering Hook Length Formulas by an Expansion Technique
— We introduce a hook length expansion technique and explain how to discover old and new hook length formulas for partitions and plane trees. The new hook length formulas for trees obtained by our method can be proved rather easily, whereas those for partitions are much more difficult and some of them still remain open conjectures. We also develop a Maple package HookExp for computing the hook ...
متن کاملGeneralized Hook Lengths in Symbols and Partitions
In this paper we present, for any integer d, a description of the set of hooks in a d-symbol. We then introduce generalized hook length functions for a d-symbol, and prove a general result about them, involving the core and quotient of the symbol. We list some applications, for example to the well-known hook lengths in integer partitions. This leads in particular to a generalization of a relati...
متن کاملHook Formulas for Skew Shapes
The celebrated hook-length formula gives a product formula for the number of standard Young tableaux of a straight shape. In 2014, Naruse announced a more general formula for the number of standard Young tableaux of skew shapes as a positive sum over excited diagrams of products of hook-lengths. We give an algebraic and a combinatorial proof of Naruse’s formula, by using factorial Schur functio...
متن کاملHook Formulas for Skew Shapes II. Combinatorial Proofs and Enumerative Applications
The Naruse hook-length formula is a recent general formula for the number of standard Young tableaux of skew shapes, given as a positive sum over excited diagrams of products of hook-lengths. In [MPP1] we gave two different q-analogues of Naruse’s formula: for the skew Schur functions, and for counting reverse plane partitions of skew shapes. In this paper we give an elementary proof of Naruse’...
متن کاملFace Recognition Based Rank Reduction SVD Approach
Standard face recognition algorithms that use standard feature extraction techniques always suffer from image performance degradation. Recently, singular value decomposition and low-rank matrix are applied in many applications,including pattern recognition and feature extraction. The main objective of this research is to design an efficient face recognition approach by combining many tech...
متن کامل